un 1 99 7 About the quantum mechanical speeding up of classical algorithms

1 Abstract It is proved, that every function F (n) computable in time T (n) and space S(n) on classical 1-dimensional cellular automaton, can be computed with certainty in time O(T 1/2 S) on quantum computer with multipro-cessor. Multiprocessor consists of √ T quantum devices P 1 , P 2 ,. .. , P √ T. They work in parallel-serial mode and interact by classical lows. Each of P i contains O(S(n)) qubits in coherent states. Advantage is taken of Grover's algorithm for the fast quantum searching. The method presented in this paper also allows to find the solution of equation ¯ x = f −1 (¯ a) for the given ¯ a and oracle for f after one quantum evaluation of f , where f : ω n −→ ω n , card(ω) = 4. 2 Introduction Quantum mechanical computations (QC) are distinct in nature from the classical ones. The point is that a quantum system can be in different classical states simultaneously with the corresponding amplitudes. The vector, composed of these amplitudes completely determines the quantum state of system. The module squared of every amplitude is the probability of detecting the system in the corresponding classical state after observation. Such an observation is the only way to obtain a result of QC. An evolution of such a system is represented by the application of unitary transformation to its vector of amplitudes. Quantum computers became one of the most popular areas of investigations in theoretical computer science as well as in quantum physics because of that in the past 3-4 years considerable progress has been made in the theory of QC. Since that time when R.Feunmann in the work [Fe] proposed quantum mechanical (Q-M) computer, D.Deutsch in the work [De] gave the first formal model of computations on quantum Turing machine (QTM), and S.Lloyd in the work [Ll] presented the physical scheme of Q-M computational device, the advantages of quantum computations over the classical ones in a variety of particular problems became apparent from the sequence of results (look, for example, at [Be],[Sh], [BE]). Moreover, A.Berthiaume and G.Brassard in [BB] showed, that Q-M computations even can beat the nondeterministic ones in computations with oracles. But as for absolute (without oracles) computations, advantages of Q-M computers over the probabilistic classical machines were not so obvious. Situation has been changed in 1994 when P.Shor in his work [Sh] suggested polynomial time …